Combined Sum of Squares Penalties for Molecular Divergence Time Estimation

نویسندگان

  • Peter J. Waddell
  • Prasanth Kalakota
چکیده

Estimates of molecular divergence times when rates of evolution vary require the assumption of a model of rate change. Brownian motion is one such model, and since rates cannot become negative, a log Brownian model seems appropriate. Divergence time estimates can then be made using weighted least squares penalties. As sequences become long, this approach effectively becomes equivalent to penalized likelihood or Bayesian approaches. Different forms of the least squares penalty are considered to take into account correlation due to shared ancestors. It is shown that a scale parameter is also needed since the sum of squares changes with the scale of time. Errors or uncertainty on fossil calibrations, may be folded in with errors due to the stochastic nature of Brownian motion and ancestral polymorphism, giving a total sum of squares to be minimized. Applying these methods to placental mammal data the estimated age of the root decreases from 125 to about 94 mybp. However, multiple fossil calibration points and relative molecular divergence times inflate the sum of squares more than expected. If fossil data are also bootstrapped, then the confidence interval for the root of placental mammals varies widely from ~70 to 130 mybp. Such a wide interval suggests that more and better fossil calibration data is needed and/or better models of rate evolution are needed and/or better molecular data are needed. Until these issues are thoroughly investigated, it is premature to declare either the old molecular dates frequently obtained (e.g. > 110 mybp) or the lack of identified placental fossils in the Cretaceous, more indicative of when crown-group placental mammals evolved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divergence times and morphological evolution of the subtribe Eritrichiinae (Boraginaceae-Rochelieae) with special reference to Lappula

The subtribe Eritrichiinae belongs to tribe Rochelieae (Borginaceae; Cynoglossoideae) which is composed of about 200 species in five genera including Eritrichium, Lappula, Hackelia, Lepechiniella, and Rochelia. The majority of the species are annual and grow in xeric habitats. The genus Lappula as an arid adapted and the second biggest genus...

متن کامل

A General Family of Penalties for Combining Differing Types of Penalties in Generalized Structured Models

Penalized estimation has become an established tool for regularization and model selection in regression models. A variety of penalties with specific features are available and effective algorithms for specific penalties have been proposed. But not much is available to fit models with a combination of different penalties. When modeling the rent data of Munich as in our application, various type...

متن کامل

Estimation of Kinetic Parameters of Coking Reaction Rate in Pyrolysis of Naphtha

The run length of cracking furnaces is limited by the formation of coke on the internal skin of the reactor tubes. The reaction mechanism of thermal cracking of hydrocarbons is generally accepted as free-radical chain reactions. On the basis of the plant output data and the insight in the mechanisms for coke formation in pyrolysis reactors, a kinetic model describing the coke formation has been...

متن کامل

Large Scale Experiments Data Analysis for Estimation of Hydrodynamic Force Coefficients Part 1: Time Domain Analysis

This paper describes various time-domain methods useful for analyzing the experimental data obtained from a circular cylinder force in terms of both wave and current for estimation of the drag and inertia coefficients applicable to the Morison’s equation. An additional approach, weighted least squares method is also introduced. A set of data obtained from experiments on heavily roughened circul...

متن کامل

An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering

Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007